@inproceedings{Bonamy2019,
address = "Dagstuhl, Germany",
author = "Bonamy, Marthe and Defrain, Oscar and Heinrich, Marc and Raymond, Jean-Florent",
booktitle = "36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)",
doi = "10.4230/LIPIcs.STACS.2019.16",
editor = "Niedermeier, Rolf and Paul, Christophe",
isbn = "978-3-95977-100-9",
issn = "1868-8969",
pages = "16:1----16:12",
publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
title = "{Enumerating Minimal Dominating Sets in Triangle-Free Graphs}",
volume = "126",
year = "2019",
}
@article{Couturier2013a,
author = "Couturier, Jean-Fran{\c{c}}ois and Heggernes, Pinar and {van 't Hof}, Pim and Kratsch, Dieter",
doi = "10.1016/j.tcs.2013.03.026",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "combinatorial bounds,enumeration algorithms,minimal dominating sets",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0304397513002508",
month = "may",
pages = "82--94",
publisher = "Elsevier B.V.",
title = "Minimal dominating sets in graph classes: Combinatorial bounds and enumeration",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0304397513002508",
volume = "487",
year = "2013",
}
@article{Fomin2008,
author = "Fomin, Fedor V. and Grandoni, Fabrizio and Pyatkin, Artem V. and Stepanov, Alexey A.",
doi = "10.1145/1435375.1435384",
issn = "15496325",
journal = "ACM Transactions on Algorithms",
keyword = "Exact exponential algorithms,domatic number,listing algorithms,measure and conquer,minimum dominating set,minimum set cover",
link = "http://dl.acm.org/citation.cfm?id=1435375.1435384",
month = "nov",
number = "1",
pages = "1--17",
publisher = "ACM",
title = "Combinatorial bounds via measure and conquer",
uri = "http://dl.acm.org/citation.cfm?id=1435375.1435384",
volume = "5",
year = "2008",
}
@inproceedings{Golovach2013a,
address = "Riga, Latvia",
author = "Golovach, PA and Heggernes, Pinar",
booktitle = "ICALP 2013: the 40th International Colloquium on Automata, Languages, and Programming",
doi = "10.1007/978-3-642-39206-1_41",
editor = "Fomin, Fedor V. and Freivalds, Rūsiņ\v{s} and Kwiatkowska, Marta and Peleg, David",
link = "http://link.springer.com/chapter/10.1007/978-3-642-39206-1_41",
month = "jul",
pages = "485--496",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "An incremental polynomial time algorithm to enumerate all minimal edge dominating sets",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-39206-1_41",
volume = "7965",
year = "2013",
}
@article{Golovach2015,
author = "Golovach, Petr A. and Heggernes, Pinar and Kant\'{e}, Mamadou M. and Kratsch, Dieter and Villanger, Yngve",
doi = "10.1016/j.dam.2014.12.010",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0166218X1400540X",
month = "jan",
pages = "30-36",
title = "Enumerating minimal dominating sets in chordal bipartite graphs",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0166218X1400540X",
volume = "199",
year = "2015",
}
@inproceedings{Kante2011,
address = "Oslo, Norway",
author = "Kant\'{e}, MM and Limouzy, Vincent and Mary, Arnaud and Nourine, L",
booktitle = "FCT 2011: the 18th International Symposium on Fundamentals of Computation Theory",
doi = "10.1007/978-3-642-22953-4_26",
editor = "Owe, Olaf and Steffen, Martin and Telle, Jan Arne",
link = "http://link.springer.com/chapter/10.1007/978-3-642-22953-4_26",
month = "aug",
pages = "298--309",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumeration of minimal dominating sets and variants",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-22953-4_26",
volume = "6914",
year = "2011",
}
@inproceedings{Kante2012,
address = "Taipei, Taiwan",
author = "Kant\'{e}, MM and Limouzy, Vincent and Mary, Arnaud and Nourine, L",
booktitle = "ISAAC 2012: the 23rd International Symposium on Algorithms and Computation",
doi = "10.1007/978-3-642-35261-4_32",
editor = "Chao, Kun-Mao and Hsu, Tsan-sheng and Lee, Der-Tsai",
link = "http://link.springer.com/chapter/10.1007/978-3-642-35261-4_32",
month = "dec",
pages = "289--298",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-35261-4_32",
volume = "7676",
year = "2012",
}
@inproceedings{Kante2013,
address = "Hong Kong, China",
author = "Kant\'{e}, MamadouMoustapha MM and Limouzy, Vincent and Mary, Arnaud and Nourine, Lhouari and Uno, Takeaki",
booktitle = "ISAAC 2013: the 24th International Symposium on Algorithms and Computation",
doi = "10.1007/978-3-642-45030-3_32",
editor = "Cai, Leizhen and Cheng, Siu-Wing and Lam, Tak-Wah",
isbn = "978-3-642-45029-7",
link = "http://dx.doi.org/10.1007/978-3-642-45030-3_32 http://www.isima.fr/~kante/articles/KanteMLNU13.pdf http://link.springer.com/chapter/10.1007/978-3-642-45030-3_32",
month = "dec",
pages = "339--349",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs",
uri = "http://dx.doi.org/10.1007/978-3-642-45030-3_32",
volume = "8283",
year = "2013",
}
@article{Kante2014,
author = "Kant\'{e}, Mamadou Moustapha and Limouzy, Vincent and Mary, Arnaud and Nourine, Lhouari",
doi = "10.1137/120862612",
issn = "0895-4801",
journal = "SIAM Journal on Discrete Mathematics",
keyword = "05C30,05C65,05C69,05C85,68R05,68R10,hypergraph dualization,minimal (connected,output polynomial time algorithm,total) dominating set enumeration,transversal problem",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/120862612",
month = "nov",
number = "4",
pages = "1916--1929",
publisher = "Society for Industrial and Applied Mathematics",
title = "On the Enumeration of Minimal Dominating Sets and Related Notions",
uri = "http://epubs.siam.org/doi/abs/10.1137/120862612",
volume = "28",
year = "2014",
}
@inproceedings{Krzywkowski2013,
address = "Dalian, China",
author = "Krzywkowski, Marcin",
booktitle = "FAW-AAIM 2013: the 3rd Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management",
doi = "10.1007/978-3-642-38756-2_4",
editor = "Fellows, Michael and Tan, Xuehou and Zhu, Binhai",
keyword = "2-domination,combinatorial bound,domination,exponential algorithm,listing algorithm,minimal 2-dominating set,tree",
link = "http://link.springer.com/chapter/10.1007/978-3-642-38756-2_4",
month = "jun",
pages = "12--16",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "An algorithm for listing all minimal 2-dominating sets of a tree",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-38756-2_4",
volume = "7924",
year = "2013",
}
@inproceedings{Wang2009,
address = "Hefei, China",
author = "Wang, Jianxin and Chen, B and Feng, Qilong and Chen, Jianer",
booktitle = "FAW 2009: the 3rd International Workshop on Frontiers in Algorithmics",
doi = "10.1007/978-3-642-02270-8_25",
editor = "Deng, Xiaotie and Hopcroft, John E. and Xue, Jinyun",
link = "http://link.springer.com/chapter/10.1007/978-3-642-02270-8_25",
month = "jun",
pages = "237--250",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "An efficient fixed-parameter enumeration algorithm for weighted edge dominating set",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-02270-8_25",
volume = "5598",
year = "2009",
}